A Brief Introduction to Typed Predicate Logic
نویسنده
چکیده
Typed Predicate Logicwas developed to o¤er a unifying framework for many of the current logical systems, and especially those that employ some notion of type or sort.
منابع مشابه
Interaction Systems and Linear Logic, a different games semantics
We define a model for linear logic based on two well-known ingredients: games and simulations. This model is interesting in the following respect: while it is obvious that the objects interpreting formulas are games and that everything is developed with the intuition of interaction in mind, the notion of morphism is very different from traditional morphisms in games semantics. In particular, we...
متن کاملThe Calculus of Constructions and Higher Order Logic
The Calculus of Constructions (CC) ([Coquand 1985]) is a typed lambda calculus for higher order intuitionistic logic: proofs of the higher order logic are interpreted as lambda terms and formulas as types. It is also the union of Girard's system F ! ([Girard 1972]), a higher order typed lambda calculus, and a rst order dependent typed lambda calculus in the style of de Bruijn's Automath ([de Br...
متن کاملThe Calculus of Constructions andHigher
The Calculus of Constructions (CC) ((Coquand 1985]) is a typed lambda calculus for higher order intuitionistic logic: proofs of the higher order logic are interpreted as lambda terms and formulas as types. It is also the union of Girard's system F ! ((Girard 1972]), a higher order typed lambda calculus, and a rst order dependent typed lambda calculus in the style of de Bruijn's Automath ((de Br...
متن کامل13th International Conference on Typed Lambda Calculi and Applications (TLCA'15)
Recently a new connection between proof theory and formal language theory was introduced. It was shown that the operation of cut elimination for proofs in first-order predicate logic involving Π1-cuts corresponds to computing the language of a particular class of regular tree grammars. The present paper expands this connection to the level of Π2-cuts. Given a proof π of a Σ1 formula with cuts o...
متن کاملContinuation-passing Style Models Complete for Intuitionistic Logic
A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and the computational content of their composition is, in particular, a β-normalisation-by-evaluation program for simply typed lambda calculus with sum types. A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010